The matching relaxation for a class of generalized set partitioning problems
نویسندگان
چکیده
منابع مشابه
A Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملUNIQUENESS OF SOLUTION FOR A CLASS OF STEFAN PROBLEMS
This paper deals with a theoretical mathematical analysis of one-dimensional solidification problem, in which kinetic undercooling is incorporated into the This temperature condition at the interface. A model problem with nonlinear kinetic law is considered. We prove a local result intimate for the uniqueness of solution of the corresponding free boundary problem.
متن کاملA Semidefinite Programming Relaxation for the Generalized Stable Set Problem
In this paper, we generalize the theory of a convex set relaxation for the maximum weight stable set problem due to Grotschel, Lov asz and Schrijver to the generalized stable set problem. We de ne a convex set which serves as a relaxation problem, and show that optimizing a linear function over the set can be done in polynomial time. This implies that the generalized stable set problem for per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.05.033